NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
731	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
732	Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:27 Parameterized complexity Analysis of algorithms Time complexity NP-complete problems Algorithm Theoretical computer science Applied mathematics Computational complexity theory
733	Claw-free graphs and two conjectures on omega, Delta, and chi Andrew King School of Computer Science McGill University, Montreal October 2009 Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:59 Graph operations Line graph Claw-free graph Clique Perfect graph Chordal graph Interval graph Neighbourhood Graph property Graph theory Graph coloring NP-complete problems
734	Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 23:13:02 Graph coloring NP-complete problems Analysis of algorithms Parameterized complexity List coloring Graph Travelling salesman problem Kernelization Edge coloring Graph theory Theoretical computer science Mathematics
735	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
736	The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch† Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:17:36 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Set cover problem Competitive analysis Algorithm Randomized rounding Euclidean algorithm Mathematics Theoretical computer science Applied mathematics
737	Paradox Issue 2, 2011 T HE M AGAZINE OF THE M ELBOURNE U NIVERSITY M ATHEMATICS AND S TATISTICS S OCIETY Page 2 Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:11 Human behavior Puzzles Leisure Crossword Sudoku Thinking outside the box Games NP-complete problems Problem solving
738	Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´ Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-26 10:03:32 Coding theory Analysis of algorithms Computational complexity theory Closest string Hamming distance Time complexity Algorithmica Theoretical computer science Applied mathematics NP-complete problems
739	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:05:29 Graph Planar graph Unit disk graph Geographic routing Graph theory Theoretical computer science NP-complete problems
740	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory

UPDATE